A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm
نویسندگان
چکیده
منابع مشابه
A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm
Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملA smart path-planning algorithm of multiple mobile robots and its wearable-based evaluation
In Robotics, many path-planning algorithms have been proposed but almost all are evaluated only in 2-D computer simulations and a few experiments without any human being. Recently, a human lives with many mobile and/or pet robots. Therefore, such a path-planning algorithm, especially, many interactions between a human and robots should be evaluated in our living space. However, a practical test...
متن کاملCellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots
This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...
متن کاملWave front Method Based Path Planning Algorithm for Mobile Robots
Path planning problem revolves around finding a path from start node to goal node without any collisions. This paper presents an improved version of Focused Wave Front Algorithm for mobile robot path planning in static 2D environment. Existing wave expansion algorithms either provide speed or optimality. We try to counter this problem by preventing the full expansion of the wave and expanding s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Smart Home
سال: 2014
ISSN: 1975-4094,1975-4094
DOI: 10.14257/ijsh.2014.8.3.07